The Ares I Crew Launch Vehicle: Human Space Access for the Moon and Beyond

The National Aeronautics and Space Administration (NASA)'s Constellation Program is depending on the Ares Projects to deliver the crew launch capabilities needed to send human explorers to the Moon and beyond. The Ares Projects continue to make progress toward design, component testing, and early flight testing of the Ares I crew launch vehicle (Figure 1), the United States first new human-rated launch vehicle in over 25 years. Ares I will provide the core space launch capabilities the United States needs to continue providing crew and cargo access to the International Space Station (ISS), maintaining the U.S. pioneering tradition as a spacefaring nation, and enabling cooperative international ventures to the Moon and beyond. This paper will discuss programmatic, design, fabrication, and testing progress toward building this new launch vehicle

Powering Exploration: The Ares I Crew Launch Vehicle and Ares V Cargo Launch Vehicle

The National Aeronautics and Space Administration (NASA)'s Constellation Program is depending on the Ares Projects to deliver the crew and cargo launch capabilities needed to send human explorers to the Moon and beyond. The Ares Projects continue to make progress toward design, component testing, and early flight testing of the Ares I crew launch vehicle, as well as early design work for Ares V cargo launch vehicle. Ares I and Ares V will form the core space launch capabilities the United States needs to continue its pioneering tradition as a spacefaring nation. This paper will discuss programmatic, design, fabrication, and testing progress toward building these new launch vehicles

A taxonomy of problems with fast parallel algorithms

The class NC consists of problems solvable very fast (in time polynomial in log n) in parallel with a feasible (polynomial) number of processors. Many natural problems in NC are known; in this paper an attempt is made to identify important subclasses of NC and give interesting examples in each subclass. The notion of NC1-reducibility is introduced and used throughout (problem R is NC1-reducible to problem S if R can be solved with uniform log-depth circuits using oracles for S). Problems complete with respect to this reducibility are given for many of the subclasses of NC. A general technique, the “parallel greedy algorithm,” is identified and used to show that finding a minimum spanning forest of a graph is reducible to the graph accessibility problem and hence is in NC2 (solvable by uniform Boolean circuits of depth O(log2 n) and polynomial size). The class LOGCFL is given a new characterization in terms of circuit families. The class DET of problems reducible to integer determinants is defined and many examples given. A new problem complete for deterministic polynomial time is given, namely, finding the lexicographically first maximal clique in a graph. This paper is a revised version of S. A. Cook, (1983, in “Proceedings 1983 Intl. Found. Comut. Sci. Conf.,” Lecture Notes in Computer Science Vol. 158, pp. 78–93, Springer-Verlag, Berlin/New York)

The Reusable Launch Vehicle Technology Program and the X-33 Advanced Technology Demonstrator

The goal of the Reusable Launch Vehicle (RLV) technology program is formulated, and the primary objectives of RLV are listed. RLV technology program implementation phases are outlined. X-33 advanced technology demonstrator is described. Program management is addressed

A Formal Theory for the Complexity Class Associated with the Stable Marriage Problem

Subramanian defined the complexity class CC as the set of problems log-space reducible to the comparator circuit value problem. He proved that several other problems are complete for CC, including the stable marriage problem, and finding the lexicographical first maximal matching in a bipartite graph. We suggest alternative definitions of CC based on different reducibilities and introduce a two-sorted theory VCC* based on one of them. We sharpen and simplify Subramanian\u27s completeness proofs for the above two problems and formalize them in VCC*

An Exponential Lower Bound for the Size of Monotone Real Circuits

AbstractWe prove a lower bound, exponential in the eighth root of the input length, on the size of monotone arithmetic circuits that solve an NP problem related to clique detection. The result is more general than the famous lower bound of Razborov and Andreev, because the gates of the circuit are allowed to compute arbitrary monotone binary real-valued functions (including AND and OR). Our proof is relatively simple and direct and uses the method of counting bottlenecks. The generalization was proved independently by Pudlák using a different method, who also showed that the result can be used to obtain an exponential lower bound on the size of unrestricted cutting plane proofs in the propositional calculus

The Next Giant Leap: NASA's Ares Launch Vehicles Overview

The next chapter in NASA's history also promises to write the next chapter in America's history, as the Agency makes measurable strides toward developing new space transportation capabilities that wi!! put astronauts on course to explore the Moon as the next giant leap toward the first human footprint on Mars. This paper will present top-level plans and progress being made toward fielding the Ares I crew launch vehicle in the 2013 timeframe and the Ares V cargo launch vehicle in the 2018 timeframe. It also gives insight into the objectives for the first test flight, known as the Ares I-X, which is scheduled for April 2009. The U.S. strategy to scientifically explore space will fuel innovations such as solar power and water recycling, as well as yield new knowledge that directly benefits life on Earth. For the Ares launch vehicles, NASA is building on heritage hardware and unique capabilities; as well as almost 50 years of lessons learned from the Apollo Saturn, Space Shuttle, and commercial launch vehicle programs. In the Ares I Project's inaugural year, extensive trade studies and evaluations were conducted to improve upon the designs initially recommended by the Exploration Systems Architecture Study, resulting in significant reduction of near-term and long-range technical and programmatic risks; conceptual designs were analyzed for fitness against requirements; and the contractual framework was assembled to enable a development effort unparalleled in American space flight since the Space Shuttle. The Exploration Launch Projects team completed the Ares I System Requirements Review (SRR) at the end of 2006--the first such engineering milestone for a human-rated space transportation system in over 30 years

Why We Explore: The Value of Space Exploration for Future Generations

The National Aeronautics and Space Administration (NASA) and its industry partners are making measurable progress toward delivering new human space transportation capabilities to serve as the catalyst for a new era of discovery, as directed by the U.S. Vision for Space Exploration. In the interest of ensuring prolonged support, the Agency encourages space advocates of all stripes to accurately portray both the tangible and intangible benefits of space exploration, especially its value for future generations. This may be done not only by emphasizing the nation's return on its aerospace investment, but also by highlighting enabling security features and by promoting the scientific and technological benefits that accrue from the human exploration of space. As America embarks on a new era of leadership and international partnership on the next frontier, we are poised to master space by living off-planet on the Moon to prepare astronauts for longer journeys to Mars. These and other relevant facts should be clearly in the view of influential decision-makers and the American taxpayers, and we must increasingly involve those on whom the long-term sustainability of space exploration ultimately depends: America's youth. This paper will examine three areas of concrete benefits for future generations: fundamental security, economic enterprise, and high-technology advancements spurred by the innovation that scientific discovery demands

NASA Exploration Launch Projects Systems Engineering Approach for Astronaut Missions to the Moon, Mars, and Beyond

The U.S. Vision for Space Exploration directs NASA to design and develop a new generation of safe, reliable, and cost-effective transportation systems to hlfill the Nation s strategic goals and objectives. These launch vehicles will provide the capability for astronauts to conduct scientific exploration that yields new knowledge from the unique vantage point of space. American leadership in opening new fi-ontiers will improve the quality of life on Earth for generations to come. The Exploration Launch Projects office is responsible for delivering the Crew Launch Vehicle (CLV) that will loft the Crew Exploration Vehicle (CEV) into low-Earth orbit (LEO) early next decade, and for the heavy lift Cargo Launch Vehicle (CaLV) that will deliver the Lunar Surface Access Module (LSAM) to LEO for astronaut return trips to the Moon by 2020 in preparation for the eventual first human footprint on Mars. Crew travel to the International Space Station will be made available as soon possible after the Space Shuttle retires in 2010

Local variations in spatial synchrony of influenza epidemics

Background: Understanding the mechanism of influenza spread across multiple geographic scales is not complete. While the mechanism of dissemination across regions and states of the United States has been described, understanding the determinants of dissemination between counties has not been elucidated. The paucity of high resolution spatial-temporal influenza incidence data to evaluate disease structure is often not available. Methodology and Findings: We report on the underlying relationship between the spread of influenza and human movement between counties of one state. Significant synchrony in the timing of epidemics exists across the entire state and decay with distance (regional correlation = 62%). Synchrony as a function of population size display evidence of hierarchical spread with more synchronized epidemics occurring among the most populated counties. A gravity model describing movement between two populations is a stronger predictor of influenza spread than adult movement to and from workplaces suggesting that non-routine and leisure travel drive local epidemics. Conclusions: These findings highlight the complex nature of influenza spread across multiple geographic scales. © 2012 Stark et al